The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^2, INF).

(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

plus(x, 0) → x
plus(0, y) → y
plus(s(x), y) → s(plus(x, y))
times(0, y) → 0
times(s(0), y) → y
times(s(x), y) → plus(y, times(x, y))
div(0, y) → 0
div(x, y) → quot(x, y, y)
quot(0, s(y), z) → 0
quot(s(x), s(y), z) → quot(x, y, z)
quot(x, 0, s(z)) → s(div(x, s(z)))
div(div(x, y), z) → div(x, times(y, z))

Rewrite Strategy: INNERMOST

(1) RenamingProof (EQUIVALENT transformation)

Renamed function symbols to avoid clashes with predefined symbol.

(2) Obligation:

Runtime Complexity Relative TRS:
The TRS R consists of the following rules:

plus(x, 0') → x
plus(0', y) → y
plus(s(x), y) → s(plus(x, y))
times(0', y) → 0'
times(s(0'), y) → y
times(s(x), y) → plus(y, times(x, y))
div(0', y) → 0'
div(x, y) → quot(x, y, y)
quot(0', s(y), z) → 0'
quot(s(x), s(y), z) → quot(x, y, z)
quot(x, 0', s(z)) → s(div(x, s(z)))
div(div(x, y), z) → div(x, times(y, z))

S is empty.
Rewrite Strategy: INNERMOST

(3) TypeInferenceProof (BOTH BOUNDS(ID, ID) transformation)

Infered types.

(4) Obligation:

Innermost TRS:
Rules:
plus(x, 0') → x
plus(0', y) → y
plus(s(x), y) → s(plus(x, y))
times(0', y) → 0'
times(s(0'), y) → y
times(s(x), y) → plus(y, times(x, y))
div(0', y) → 0'
div(x, y) → quot(x, y, y)
quot(0', s(y), z) → 0'
quot(s(x), s(y), z) → quot(x, y, z)
quot(x, 0', s(z)) → s(div(x, s(z)))
div(div(x, y), z) → div(x, times(y, z))

Types:
plus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
times :: 0':s → 0':s → 0':s
div :: 0':s → 0':s → 0':s
quot :: 0':s → 0':s → 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

(5) OrderProof (LOWER BOUND(ID) transformation)

Heuristically decided to analyse the following defined symbols:
plus, times, div, quot

They will be analysed ascendingly in the following order:
plus < times
times < div
div = quot

(6) Obligation:

Innermost TRS:
Rules:
plus(x, 0') → x
plus(0', y) → y
plus(s(x), y) → s(plus(x, y))
times(0', y) → 0'
times(s(0'), y) → y
times(s(x), y) → plus(y, times(x, y))
div(0', y) → 0'
div(x, y) → quot(x, y, y)
quot(0', s(y), z) → 0'
quot(s(x), s(y), z) → quot(x, y, z)
quot(x, 0', s(z)) → s(div(x, s(z)))
div(div(x, y), z) → div(x, times(y, z))

Types:
plus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
times :: 0':s → 0':s → 0':s
div :: 0':s → 0':s → 0':s
quot :: 0':s → 0':s → 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

Generator Equations:
gen_0':s2_0(0) ⇔ 0'
gen_0':s2_0(+(x, 1)) ⇔ s(gen_0':s2_0(x))

The following defined symbols remain to be analysed:
plus, times, div, quot

They will be analysed ascendingly in the following order:
plus < times
times < div
div = quot

(7) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
plus(gen_0':s2_0(n4_0), gen_0':s2_0(b)) → gen_0':s2_0(+(n4_0, b)), rt ∈ Ω(1 + n4₀)

Induction Base:
plus(gen_0':s2_0(0), gen_0':s2_0(b)) →_R^Ω(1)
gen_0':s2_0(b)

Induction Step:
plus(gen_0':s2_0(+(n4_0, 1)), gen_0':s2_0(b)) →_R^Ω(1)
s(plus(gen_0':s2_0(n4_0), gen_0':s2_0(b))) →_IH
s(gen_0':s2_0(+(b, c5_0)))

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(8) Complex Obligation (BEST)

(9) Obligation:

Innermost TRS:
Rules:
plus(x, 0') → x
plus(0', y) → y
plus(s(x), y) → s(plus(x, y))
times(0', y) → 0'
times(s(0'), y) → y
times(s(x), y) → plus(y, times(x, y))
div(0', y) → 0'
div(x, y) → quot(x, y, y)
quot(0', s(y), z) → 0'
quot(s(x), s(y), z) → quot(x, y, z)
quot(x, 0', s(z)) → s(div(x, s(z)))
div(div(x, y), z) → div(x, times(y, z))

Types:
plus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
times :: 0':s → 0':s → 0':s
div :: 0':s → 0':s → 0':s
quot :: 0':s → 0':s → 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

Lemmas:
plus(gen_0':s2_0(n4_0), gen_0':s2_0(b)) → gen_0':s2_0(+(n4_0, b)), rt ∈ Ω(1 + n4₀)

Generator Equations:
gen_0':s2_0(0) ⇔ 0'
gen_0':s2_0(+(x, 1)) ⇔ s(gen_0':s2_0(x))

The following defined symbols remain to be analysed:
times, div, quot

They will be analysed ascendingly in the following order:
times < div
div = quot

(10) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
times(gen_0':s2_0(n697_0), gen_0':s2_0(b)) → gen_0':s2_0(*(n697_0, b)), rt ∈ Ω(1 + b·n697₀ + n697₀)

Induction Base:
times(gen_0':s2_0(0), gen_0':s2_0(b)) →_R^Ω(1)
0'

Induction Step:
times(gen_0':s2_0(+(n697_0, 1)), gen_0':s2_0(b)) →_R^Ω(1)
plus(gen_0':s2_0(b), times(gen_0':s2_0(n697_0), gen_0':s2_0(b))) →_IH
plus(gen_0':s2_0(b), gen_0':s2_0(*(c698_0, b))) →_L^{Ω(1 + b)}
gen_0':s2_0(+(b, *(n697_0, b)))

We have rt ∈ Ω(n²) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n²).

(11) Complex Obligation (BEST)

(12) Obligation:

Innermost TRS:
Rules:
plus(x, 0') → x
plus(0', y) → y
plus(s(x), y) → s(plus(x, y))
times(0', y) → 0'
times(s(0'), y) → y
times(s(x), y) → plus(y, times(x, y))
div(0', y) → 0'
div(x, y) → quot(x, y, y)
quot(0', s(y), z) → 0'
quot(s(x), s(y), z) → quot(x, y, z)
quot(x, 0', s(z)) → s(div(x, s(z)))
div(div(x, y), z) → div(x, times(y, z))

Types:
plus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
times :: 0':s → 0':s → 0':s
div :: 0':s → 0':s → 0':s
quot :: 0':s → 0':s → 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

Lemmas:
plus(gen_0':s2_0(n4_0), gen_0':s2_0(b)) → gen_0':s2_0(+(n4_0, b)), rt ∈ Ω(1 + n4₀)
times(gen_0':s2_0(n697_0), gen_0':s2_0(b)) → gen_0':s2_0(*(n697_0, b)), rt ∈ Ω(1 + b·n697₀ + n697₀)

Generator Equations:
gen_0':s2_0(0) ⇔ 0'
gen_0':s2_0(+(x, 1)) ⇔ s(gen_0':s2_0(x))

The following defined symbols remain to be analysed:
quot, div

They will be analysed ascendingly in the following order:
div = quot

(13) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
quot(gen_0':s2_0(n1658_0), gen_0':s2_0(+(1, n1658_0)), gen_0':s2_0(c)) → gen_0':s2_0(0), rt ∈ Ω(1 + n1658₀)

Induction Base:
quot(gen_0':s2_0(0), gen_0':s2_0(+(1, 0)), gen_0':s2_0(c)) →_R^Ω(1)
0'

Induction Step:
quot(gen_0':s2_0(+(n1658_0, 1)), gen_0':s2_0(+(1, +(n1658_0, 1))), gen_0':s2_0(c)) →_R^Ω(1)
quot(gen_0':s2_0(n1658_0), gen_0':s2_0(+(1, n1658_0)), gen_0':s2_0(c)) →_IH
gen_0':s2_0(0)

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(14) Complex Obligation (BEST)

(15) Obligation:

Innermost TRS:
Rules:
plus(x, 0') → x
plus(0', y) → y
plus(s(x), y) → s(plus(x, y))
times(0', y) → 0'
times(s(0'), y) → y
times(s(x), y) → plus(y, times(x, y))
div(0', y) → 0'
div(x, y) → quot(x, y, y)
quot(0', s(y), z) → 0'
quot(s(x), s(y), z) → quot(x, y, z)
quot(x, 0', s(z)) → s(div(x, s(z)))
div(div(x, y), z) → div(x, times(y, z))

Types:
plus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
times :: 0':s → 0':s → 0':s
div :: 0':s → 0':s → 0':s
quot :: 0':s → 0':s → 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

Lemmas:
plus(gen_0':s2_0(n4_0), gen_0':s2_0(b)) → gen_0':s2_0(+(n4_0, b)), rt ∈ Ω(1 + n4₀)
times(gen_0':s2_0(n697_0), gen_0':s2_0(b)) → gen_0':s2_0(*(n697_0, b)), rt ∈ Ω(1 + b·n697₀ + n697₀)
quot(gen_0':s2_0(n1658_0), gen_0':s2_0(+(1, n1658_0)), gen_0':s2_0(c)) → gen_0':s2_0(0), rt ∈ Ω(1 + n1658₀)

Generator Equations:
gen_0':s2_0(0) ⇔ 0'
gen_0':s2_0(+(x, 1)) ⇔ s(gen_0':s2_0(x))

The following defined symbols remain to be analysed:
div

They will be analysed ascendingly in the following order:
div = quot

(16) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol div.

(17) Obligation:

Innermost TRS:
Rules:
plus(x, 0') → x
plus(0', y) → y
plus(s(x), y) → s(plus(x, y))
times(0', y) → 0'
times(s(0'), y) → y
times(s(x), y) → plus(y, times(x, y))
div(0', y) → 0'
div(x, y) → quot(x, y, y)
quot(0', s(y), z) → 0'
quot(s(x), s(y), z) → quot(x, y, z)
quot(x, 0', s(z)) → s(div(x, s(z)))
div(div(x, y), z) → div(x, times(y, z))

Types:
plus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
times :: 0':s → 0':s → 0':s
div :: 0':s → 0':s → 0':s
quot :: 0':s → 0':s → 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

Lemmas:
plus(gen_0':s2_0(n4_0), gen_0':s2_0(b)) → gen_0':s2_0(+(n4_0, b)), rt ∈ Ω(1 + n4₀)
times(gen_0':s2_0(n697_0), gen_0':s2_0(b)) → gen_0':s2_0(*(n697_0, b)), rt ∈ Ω(1 + b·n697₀ + n697₀)
quot(gen_0':s2_0(n1658_0), gen_0':s2_0(+(1, n1658_0)), gen_0':s2_0(c)) → gen_0':s2_0(0), rt ∈ Ω(1 + n1658₀)

Generator Equations:
gen_0':s2_0(0) ⇔ 0'
gen_0':s2_0(+(x, 1)) ⇔ s(gen_0':s2_0(x))

No more defined symbols left to analyse.

(18) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n²) was proven with the following lemma:
times(gen_0':s2_0(n697_0), gen_0':s2_0(b)) → gen_0':s2_0(*(n697_0, b)), rt ∈ Ω(1 + b·n697₀ + n697₀)

(19) BOUNDS(n^2, INF)

(20) Obligation:

Innermost TRS:
Rules:
plus(x, 0') → x
plus(0', y) → y
plus(s(x), y) → s(plus(x, y))
times(0', y) → 0'
times(s(0'), y) → y
times(s(x), y) → plus(y, times(x, y))
div(0', y) → 0'
div(x, y) → quot(x, y, y)
quot(0', s(y), z) → 0'
quot(s(x), s(y), z) → quot(x, y, z)
quot(x, 0', s(z)) → s(div(x, s(z)))
div(div(x, y), z) → div(x, times(y, z))

Types:
plus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
times :: 0':s → 0':s → 0':s
div :: 0':s → 0':s → 0':s
quot :: 0':s → 0':s → 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

Lemmas:
plus(gen_0':s2_0(n4_0), gen_0':s2_0(b)) → gen_0':s2_0(+(n4_0, b)), rt ∈ Ω(1 + n4₀)
times(gen_0':s2_0(n697_0), gen_0':s2_0(b)) → gen_0':s2_0(*(n697_0, b)), rt ∈ Ω(1 + b·n697₀ + n697₀)
quot(gen_0':s2_0(n1658_0), gen_0':s2_0(+(1, n1658_0)), gen_0':s2_0(c)) → gen_0':s2_0(0), rt ∈ Ω(1 + n1658₀)

Generator Equations:
gen_0':s2_0(0) ⇔ 0'
gen_0':s2_0(+(x, 1)) ⇔ s(gen_0':s2_0(x))

No more defined symbols left to analyse.

(21) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n²) was proven with the following lemma:
times(gen_0':s2_0(n697_0), gen_0':s2_0(b)) → gen_0':s2_0(*(n697_0, b)), rt ∈ Ω(1 + b·n697₀ + n697₀)

(22) BOUNDS(n^2, INF)

(23) Obligation:

Innermost TRS:
Rules:
plus(x, 0') → x
plus(0', y) → y
plus(s(x), y) → s(plus(x, y))
times(0', y) → 0'
times(s(0'), y) → y
times(s(x), y) → plus(y, times(x, y))
div(0', y) → 0'
div(x, y) → quot(x, y, y)
quot(0', s(y), z) → 0'
quot(s(x), s(y), z) → quot(x, y, z)
quot(x, 0', s(z)) → s(div(x, s(z)))
div(div(x, y), z) → div(x, times(y, z))

Types:
plus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
times :: 0':s → 0':s → 0':s
div :: 0':s → 0':s → 0':s
quot :: 0':s → 0':s → 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

Lemmas:
plus(gen_0':s2_0(n4_0), gen_0':s2_0(b)) → gen_0':s2_0(+(n4_0, b)), rt ∈ Ω(1 + n4₀)
times(gen_0':s2_0(n697_0), gen_0':s2_0(b)) → gen_0':s2_0(*(n697_0, b)), rt ∈ Ω(1 + b·n697₀ + n697₀)

Generator Equations:
gen_0':s2_0(0) ⇔ 0'
gen_0':s2_0(+(x, 1)) ⇔ s(gen_0':s2_0(x))

No more defined symbols left to analyse.

(24) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n²) was proven with the following lemma:
times(gen_0':s2_0(n697_0), gen_0':s2_0(b)) → gen_0':s2_0(*(n697_0, b)), rt ∈ Ω(1 + b·n697₀ + n697₀)

(25) BOUNDS(n^2, INF)

(26) Obligation:

Innermost TRS:
Rules:
plus(x, 0') → x
plus(0', y) → y
plus(s(x), y) → s(plus(x, y))
times(0', y) → 0'
times(s(0'), y) → y
times(s(x), y) → plus(y, times(x, y))
div(0', y) → 0'
div(x, y) → quot(x, y, y)
quot(0', s(y), z) → 0'
quot(s(x), s(y), z) → quot(x, y, z)
quot(x, 0', s(z)) → s(div(x, s(z)))
div(div(x, y), z) → div(x, times(y, z))

Types:
plus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
times :: 0':s → 0':s → 0':s
div :: 0':s → 0':s → 0':s
quot :: 0':s → 0':s → 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

Lemmas:
plus(gen_0':s2_0(n4_0), gen_0':s2_0(b)) → gen_0':s2_0(+(n4_0, b)), rt ∈ Ω(1 + n4₀)

Generator Equations:
gen_0':s2_0(0) ⇔ 0'
gen_0':s2_0(+(x, 1)) ⇔ s(gen_0':s2_0(x))

No more defined symbols left to analyse.

(27) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
plus(gen_0':s2_0(n4_0), gen_0':s2_0(b)) → gen_0':s2_0(+(n4_0, b)), rt ∈ Ω(1 + n4₀)

(28) BOUNDS(n^1, INF)